A Priority Scheme Applied to Scalable Reliablemulticast

نویسندگان

  • Daniel Antunes Maciel Villela
  • Otto Carlos Muniz B. Duarte
چکیده

Scalability in reliable multicast communications is a primal requirement, since there is a large growth of distributed applications based on internetworking with global dimensions. This paper proposes a priority scheme applied to three reliable multicast protocols, resulting in diierent generic models and performance evaluation for these models is established. The results show that the priority scheme ensures more robustness when possible variations of network states take place. There is a slight diierence for the mean delay experimented under this scheme, when an increase in loss probability or in network load occurs. The mean delay has also little sensibility due to raise of number of participants in the multicast system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic configuration and collaborative scheduling in supply chains based on scalable multi-agent architecture

Due to diversified and frequently changing demands from customers, technological advances and global competition, manufacturers rely on collaboration with their business partners to share costs, risks and expertise. How to take advantage of advancement of technologies to effectively support operations and create competitive advantage is critical for manufacturers to survive. To respond to these...

متن کامل

A QoS Based Routing Algorithm for Multi-class Optimization in DiffServ Networks

DiffServ has been proposed as a scalable model to offer various quality of services (QoS) in the Internet. It supports diverse traffic classes with different priorities. However, recent work has discovered that high priority classes (e.g., EF class) have significant impact on the performance of low priority classes (e.g., BE class) when traditional shortest path (SP) routing algorithms are appl...

متن کامل

A High-Performance Encoder With Priority Lookahead

In this brief, we introduce a priority encoder that uses a novel priority lookahead (PL) scheme to reduce delays associated with priority propagation. Two priority encoder approaches are presented, one without and the other with a PL scheme. For an -bit encoder, the circuit with the PL scheme requires about 0.1 more transistors than the circuit without the scheme. However, a 32-bit very large s...

متن کامل

A Low Complexity Prioritized Bit-plane Coding for SNR Scalability in MPEG-21 Scalable Video Coding

In this paper, we propose a low complexity prioritized bit-plane coding scheme to improve the rate-distortion performance of cyclical block coding in MPEG-21 scalable video coding. Specifically, we use a block priority assignment algorithm to firstly transmit the symbols and the blocks with potentially better rate-distortion performance. Different blocks are allowed to be coded unequally in a c...

متن کامل

A VLSI High-Performance Encoder with Priority Lookahead

In this paper we introduce a VLSI priority encoder that uses a novel priority lookahead scheme to reduce the delay for the worse case operation of the circuit, while maintaining a very low transistor count. The encoder's topmost input request has the highest priority; this priority descends linearly. Two design approaches for the priority encoder are presented, one without a priority lookahead ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998